Parametrized Exceptions
نویسندگان
چکیده
Following the paradigm of encapsulation of side effects via monads, the Java execution mechanism has been described by the socalled Java monad, encorporating essentially stateful computation and exceptions, which are heavily used in Java control flow. A technical problem that appears in this model is the fact that the return exception in Java is parametrized by the return value, so that method calls actually move between slightly different monads, depending on the type of the return value. We provide a treatment of this problem in the general framework of exception monads as introduced in earlier work by some of the authors; this framework includes generic partial and total Hoare calculi for abrupt termination. Moreover, we illustrate this framework by means of a verification of a pattern match algorithm.
منابع مشابه
On the rank of certain parametrized elliptic curves
In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.
متن کاملParametrized Linear
In the behavioral approach a dynamical system is essentially determined by a set of trajectories B, which is called behavior. There exist various ways for representing behaviors that are linear and shift-invariant: kernel representations, image representations and latent variable representations. In this paper we deal with families of parametrized linear shift-invariant behaviors and with the p...
متن کاملParametrized Homotopy Theory
We develop rigorous foundations for parametrized homotopy theory. After preliminaries on point-set topology, base change functors, and proper actions of non-compact Lie groups, we develop the homotopy theory of equivariant ex-spaces (spaces over and under a given space) and of equivariant parametrized spectra. We emphasize several issues of independent interest and include a good deal of new ma...
متن کاملA Parametrized Propositional Dynamic Logic with Application to Service Synthesis
We extend propositional dynamic logic (PDL) with variables ranging over an infinite domain. This extension, called parametrized PDL or PPDL for short, is interpreted over parametrized transitions systems whose edges are labeled with letters or variables and whose states are labeled with non-parametrized propositions. We show that the satisfiability problem for PPDL is decidable. We apply these ...
متن کاملLearning Compliant Locomotion on a Quadruped Robot
Over the last decades, compliant locomotion and manipulation have become a very active field of research, due to the versatility that robots with such capabilities would offer in many applications. With very few exceptions, generally, robotic applications and experiments take place in controlled environments. One of the reasons of this limited use is that in real world scenarios, robots need to...
متن کامل